Goto

Collaborating Authors

 color distribution




LearningtoSeebyLookingatNoise-Supplementary Material

Neural Information Processing Systems

Dead leaves - Textures . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . Wetrain with stochastic gradient descent with momentum (set to0.9)for200epochs, starting with a learning rate of0.36 and decaying itby afactor of0.1atepochs155,170and185. The dimensionality of the last and the penultimate embedding are 128 and 4096 respectively. From left to right the columns correspond to the tasks: EuroSAT, Resisc45, Diabetic Retinopathy and Patch Camelyon. Here, wepresent additional data forthese experiments, and provide thefull distributions forthese criteria and all datasets.


Unsupervised Graph Neural Network Framework for Balanced Multipatterning in Advanced Electronic Design Automation Layouts

Helaly, Abdelrahman, Sakr, Nourhan, Madkour, Kareem, Torunoglu, Ilhami

arXiv.org Artificial Intelligence

Abstract-- Multipatterning is an essential decomposition strategy in electronic design automation (EDA) that overcomes lithographic limitations when printing dense circuit layouts. Although heuristic-based backtracking and SA T solvers can address these challenges, they often struggle to simultaneously handle both complex constraints and secondary objectives. In this study, we present a hybrid workflow that casts multipatterning as a variant of a constrained graph coloring problem with the primary objective of minimizing feature violations and a secondary objective of balancing the number of features on each mask. Our pipeline integrates two main components: (1) A GNN-based agent, trained in an unsupervised manner to generate initial color predictions, which are refined by (2) refinement strategies (a GNN-based heuristic and simulated annealing) that together enhance solution quality and balance. Experimental evaluation in both proprietary data sets and publicly available open source layouts demonstrate complete conflict-free decomposition and consistent color balancing. The proposed framework provides a reproducible, data-efficient and deployable baseline for scalable layout decomposition in EDA workflows. As semiconductor technology progresses, the demand for higher circuit densities continues to surpass the limits of conventional lithographic techniques. The ongoing reduction in feature size introduces increasingly complex manufacturing constraints, making it difficult to accurately print intricate patterns on a single mask without defects. To address these challenges, modern electronic design automation (EDA) tools and fabrication processes rely on multipatterning, which is a layout decomposition technique that ensures manufacturability while preserving design integrity. In modern integrated circuit (IC) design, Design Rule Checking (DRC) is a critical step that ensures that the physical layout complies with a set of rules derived from the manufacturing constraints. These rules include the requirements on spacing, width, enclosure, and other geometric and connectivity constraints.


Lightweight Optimal-Transport Harmonization on Edge Devices

Larchenko, Maria, Guskov, Dmitry, Lobashev, Alexander, Derevyanko, Georgy

arXiv.org Artificial Intelligence

Color harmonization adjusts the colors of an inserted object so that it perceptually matches the surrounding image, resulting in a seamless composite. The harmonization problem naturally arises in augmented reality (AR), yet harmonization algorithms are not currently integrated into AR pipelines because real-time solutions are scarce. In this work, we address color harmonization for AR by proposing a lightweight approach that supports on-device inference. For this, we leverage classical optimal transport theory by training a compact encoder to predict the Monge-Kantorovich transport map. We benchmark our MKL-Harmonizer algorithm against state-of-the-art methods and demonstrate that for real composite AR images our method achieves the best aggregated score. We release our dedicated AR dataset of composite images with pixel-accurate masks and data-gathering toolkit to support further data acquisition by researchers.





FUSION: Frequency-guided Underwater Spatial Image recOnstructioN

Walia, Jaskaran Singh, Venkatraman, Shravan, LK, Pavithra

arXiv.org Artificial Intelligence

Underwater images suffer from severe degradations, including color distortions, reduced visibility, and loss of structural details due to wavelength-dependent attenuation and scattering. Existing enhancement methods primarily focus on spatial-domain processing, neglecting the frequency domain's potential to capture global color distributions and long-range dependencies. T o address these limitations, we propose FUSION, a dual-domain deep learning framework that jointly leverages spatial and frequency domain information. FUSION independently processes each RGB channel through multi-scale convolutional kernels and adaptive attention mechanisms in the spatial domain, while simultaneously extracting global structural information via FFT-based frequency attention. A Frequency Guided Fusion module integrates complementary features from both domains, followed by inter-channel fusion and adaptive channel recalibration to ensure balanced color distributions. Extensive experiments on benchmark datasets (UIEB, EUVP, SUIM-E) demonstrate that FUSION achieves state-of-the-art performance, consistently outperforming existing methods in reconstruction fidelity (highest PSNR of 23.717 dB and SSIM of 0.883 on UIEB), perceptual quality (lowest LPIPS of 0.112 on UIEB), and visual enhancement metrics (best UIQM of 3.414 on UIEB), while requiring significantly fewer parameters (0.28M) and lower computational complexity, demonstrating its suitability for real-time underwater imaging applications.


A Relaxed Wasserstein Distance Formulation for Mixtures of Radially Contoured Distributions

Chen, Keyu, Wang, Zetian, Zhang, Yunxin

arXiv.org Machine Learning

Recently, a Wasserstein-type distance for Gaussian mixture models has been proposed. However, that framework can only be generalized to identifiable mixtures of general elliptically contoured distributions whose components come from the same family and satisfy marginal consistency. In this paper, we propose a simple relaxed Wasserstein distance for identifiable mixtures of radially contoured distributions whose components can come from different families. We show some properties of this distance and that its definition does not require marginal consistency. We apply this distance in color transfer tasks and compare its performance with the Wasserstein-type distance for Gaussian mixture models in an experiment. The error of our method is more stable and the color distribution of our output image is more desirable.